منابع مشابه
The Generalized Stable Allocation Problem
We introduce and study the generalized stable allocation problem, an “ordinal” variant of the well-studied generalized assignment problem in which we seek a fractional assignment that is stable (in the same sense as in the classical stable marriage problem) with respect to a two-sided set of ranked preference lists. We develop an O(m logn) algorithm for solving this problem in a bipartite assig...
متن کاملOn the topological equivalence of some generalized metric spaces
The aim of this paper is to establish the equivalence between the concepts of an $S$-metric space and a cone $S$-metric space using some topological approaches. We introduce a new notion of a $TVS$-cone $S$-metric space using some facts about topological vector spaces. We see that the known results on cone $S$-metric spaces (or $N$-cone metric spaces) can be directly obtained from...
متن کاملStable Matchings for A Generalized Marriage Problem
We show, that a simple generalization of the Deferred Acceptance Procedure with men proposing due to Gale and Shapley (1962), yields outcomes for a generalized marriage problem, which are necessarily stable. We also show, that any outcome of this procedure is Weakly Pareto Optimal for Men, i.e. there is no other outcome which all men prefer to an outcome of this procedure. In a final concluding...
متن کاملA Semidefinite Programming Relaxation for the Generalized Stable Set Problem
In this paper, we generalize the theory of a convex set relaxation for the maximum weight stable set problem due to Grotschel, Lov asz and Schrijver to the generalized stable set problem. We de ne a convex set which serves as a relaxation problem, and show that optimizing a linear function over the set can be done in polynomial time. This implies that the generalized stable set problem for per...
متن کاملThe Generalized Stable Set Problem for Perfect Bidirected Graphs
Bidirected graphs are a generalization of undirected graphs. For bidirected graphs, we can consider a problem whichi is a natural extension of the maximum weighted stable set problem for undirected graphs. Here we call this problem the generalized stable set problem. It is well known that the maximum weighted stable set problem is solvable in polynomial time for perfect undirected graphs. Perfe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2012
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2012.08.021